import collections
class Solution(object):
    def kthDistinct(self, arr, k):
        c = collections.Counter(arr)
        r_set = set()
        for key in c:
            if c[key] == 1:
                r_set.add(key)
        if len(r_set) < k:
            return ''
        c = 0
        for s in arr:
            if s in r_set:
                c += 1
                if c == k:
                    return s

